Accelerating the Computation of Dead and Concurrent Places Using Reductions

We propose a new method for accelerating the computation of concurrency relation, that is all pairs places in Petri net can be marked together. Our approach relies on state space abstraction, involves mix between structural reductions and linear algebra, data-structure specifically designed our task. algorithms are implemented tool, called Kong, we test large collection models used during 2020 edition Model Checking Contest. experiments show works well, even when moderate amount applies.